Continous Conceptual Set Covering: Learning Robot Operators From Examples
نویسنده
چکیده
Continuous Conceptual Set Covering (CCSC) is an algorithm that uses engineering knowledge to learn operator effects from training examples. The program produces an operator hypothesis that, even in noisy and nondeterministic domains, can make good quantitative predictions. An empirical evaluation in the traytilting domain shows that CCSC learns faster than an alternative case-based approach. The best results, however, come from integrating CCSC and the case-based approach. Figure 1. Experimental Set Up
منابع مشابه
Conceptual Set Covering: Improving Fit-And-Split Algorithms
Many learning systems implicitly use the fit-andsplit learning method to create a comprehensive hypothesis from a set of partial hypotheses. At the core of the fit-and-split method is the assignment of examples to partial hypotheses. To date, however, this core has been neglected. This paper provides the first definition and model of the fit-and-split assignment problem. Extant systems perform ...
متن کاملA Q-learning Based Continuous Tuning of Fuzzy Wall Tracking
A simple easy to implement algorithm is proposed to address wall tracking task of an autonomous robot. The robot should navigate in unknown environments, find the nearest wall, and track it solely based on locally sensed data. The proposed method benefits from coupling fuzzy logic and Q-learning to meet requirements of autonomous navigations. Fuzzy if-then rules provide a reliable decision maki...
متن کاملThe PSOM Algorithm and Applications
Abstract: In this paper we discuss the “Parameterized Selforganizing Maps” (PSOM) as a learning method for rapidly creating high-dimensional, continuous mappings. The PSOM can be viewed as the continous generalization of the discrete topology preserving map build by Kohonen’s SOM algorithm. By making use of available topological information the PSOM shows excellent generalization capabilities f...
متن کاملMultigranulation single valued neutrosophic covering-based rough sets and their applications to multi-criteria group decision making
In this paper, three types of (philosophical, optimistic and pessimistic) multigranulation single valued neutrosophic (SVN) covering-based rough set models are presented, and these three models are applied to the problem of multi-criteria group decision making (MCGDM).Firstly, a type of SVN covering-based rough set model is proposed.Based on this rough set model, three types of mult...
متن کاملCharacteristic matrix of covering and its application to Boolean matrix decomposition
Covering-based rough sets provide an efficient theory to deal with covering data which widely exist in practical applications. Boolean matrix decomposition has been widely applied to data mining and machine learning. In this paper, three types of existing covering approximation operators are represented by boolean matrices, and then they are used to decompose into boolean matrices. First, we de...
متن کامل